Pattern Avoiding Permutations
نویسنده
چکیده
We establish a bijection from the set of all permutations (of a given length) that avoid a pattern q and a context-sensitive language.
منابع مشابه
AVOIDANCE OF PARTIALLY ORDERED PATTERNS OF THE FORM k-σ-k
Sergey Kitaev [4] has shown that the exponential generating function for permutations avoiding the generalized pattern σ-k, where σ is a pattern without dashes and k is one greater than the largest element in σ, is determined by the exponential generating function for permutations avoiding σ. We show that the exponential generating function for permutations avoiding the partially ordered patter...
متن کاملImplicit Generation of Pattern-Avoiding Permutations Based on πDDs
Pattern-avoiding permutations are permutations where none of the subsequences match the relative order of a given pattern. Pattern-avoiding permutations are related to practical and abstract mathematical problems and can provide simple representations for such problems. For example, some floorplans, which are used for optimizing very-large-scale integration(VLSI) circuit design, can be encoded ...
متن کاملSymmetric Permutations Avoiding Two Patterns ∗
Symmetric pattern-avoiding permutations are restricted permutations which are invariant under actions of certain subgroups of D4, the symmetry group of a square. We examine pattern-avoiding permutations with 180◦ rotational-symmetry. In particular, we use combinatorial techniques to enumerate symmetric permutations which avoid one pattern of length three and one pattern of length four. Our resu...
متن کاملRestricted Dumont permutations, Dyck paths, and noncrossing partitions
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that use...
متن کاملThe Enumeration of Maximally Clustered Permutations
The maximally clustered permutations are characterized by avoiding the classical permutation patterns {3421, 4312, 4321}. This class contains the freely braided permutations and the fully commutative permutations. In this work, we show that the generating functions for certain fully commutative pattern classes can be transformed to give generating functions for the corresponding freely braided ...
متن کاملClassical Sequences Revisited with Permutations Avoiding Dotted Pattern
Inspired by the definition of the barred pattern-avoiding permutation, we introduce the new concept of dotted pattern for permutations. We investigate permutations classes avoiding dotted patterns of length at most 3, possibly along with other classical patterns. We deduce some enumerating results which allow us to exhibit new families of permutations counted by the classical sequences: 2n, Cat...
متن کامل